Iterative flattening search for resource constrained scheduling

نویسندگان

  • Angelo Oddi
  • Amedeo Cesta
  • Nicola Policella
  • Stephen F. Smith
چکیده

Iterative Flattening Search (IFS) is a meta-heuristic strategy for solving multi-capacity scheduling problems. Given an initial solution, IFS iteratively applies: (1) a relaxationstep, in which a subset of scheduling decisions are randomly retracted from the current solution; and (2) a flattening-step, in which a new solution is incrementally recomputed from this partial schedule. Whenever a better solution is found, it is retained, and, upon termination, the best solution found during the search is returned. Prior research has shown IFS to be an effective and scalable heuristic procedure for minimizing schedule makespan in multi-capacity resource settings. In this paper we experimentally investigate the impact on IFS performance of algorithmic variants of the flattening step. The variants considered are distinguished by different computational requirements and correspondingly vary in the type and depth of search performed. The analysis is centered around the idea that given a time bound to the overall optimization procedure, the IFS optimization process is driven by two different and contrasting mechanisms: the random sampling performed by iteratively applying the “relaxation/flattening” cycle and the search conducted within the Angelo Oddi ISTC-CNR, National Research Council of Italy, Via San Martino della Battaglia 44, I-00185 Rome, Italy Tel.: +39-06-44595-214 Fax: +39-06-44595-243 E-mail: [email protected] Amedeo Cesta ISTC-CNR, National Research Council of Italy, Via San Martino della Battaglia 44, I-00185 Rome, Italy E-mail: [email protected] Nicola Policella European Space Agency, Darmstadt, Germany, Robert-Bosch-Strasse 5, 64293 Darmstadt Germany E-mail: [email protected] Stephen F. Smith The Robotics Institute, Carnegie Mellon University, 5000 Forbes Avenue, Pittsburgh, PA 15213, USA E-mail: [email protected] constituent flattening procedure. On one hand, one might expect that efficiency of the flattening process is key: the faster the flattening procedure, the greater the number of iterations (and number of sampled solutions) for a given time bound; and hence the greater the probability of finding better quality solutions. On the other hand, the use of more accurate (and more costly) flattening procedures can increase the probability of obtaining better quality solutions even if their greater computational cost reduces the number of IFS iterations. Comparative results on well-studied benchmark problems are presented that clarify this tradeoff with respect to previously proposed flattening strategies, identify qualitative guidelines for the design of effective IFS procedures, and suggest some new directions for future work in this area.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

AN EXPERIMENTAL INVESTIGATION OF THE SOUNDS OF SILENCE METAHEURISTIC FOR THE MULTI-MODE RESOURCE-CONSTRAINED PROJECT SCHEDULING WITH PRE-OPTIMIZED REPERTOIRE ON THE HARDEST MMLIB+ SET

This paper presents an experimental investigation of the Sounds of Silence (SoS) harmony search metaheuristic for the multi-mode resource-constrained project scheduling problem (MRCPSP) using a pre-optimized starting repertoire. The presented algorithm is based on the time oriented version of the SoS harmony search metaheuristic developed by Csébfalvi et al. [1] for the single-mode resource-con...

متن کامل

Iterative Flattening: A Scalable Method for Solving Multi-Capacity Scheduling Problems

One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the computational burden of techniques for reasoning about more complex types of temporal and resource capacity constraints places fairly restrictive limits on the size of problems that can be effectively addressed. In this pa...

متن کامل

An Energy-efficient Mathematical Model for the Resource-constrained Project Scheduling Problem: An Evolutionary Algorithm

In this paper, we propose an energy-efficient mathematical model for the resource-constrained project scheduling problem to optimize makespan and consumption of energy, simultaneously. In the proposed model, resources are speed-scaling machines. The problem is NP-hard in the strong sense. Therefore, a multi-objective fruit fly optimization algorithm (MOFOA) is developed. The MOFOA uses the VIKO...

متن کامل

Solving Resource-Constrained Project Scheduling Problems with Time-Windows Using Iterative Improvement Algorithms

This paper proposes an iterative improvement approach for solving the Resource Constraint Project Scheduling Problem with Time-Windows (RCPSP/max), a well-known and challenging NP-hard scheduling problem. The algorithm is based on Iterative Flattening Search (IFS), an effective heuristic strategy for solving multi-capacity optimization scheduling problems. Given an initial solution, IFS iterati...

متن کامل

ROBUST RESOURCE-CONSTRAINED PROJECT SCHEDULING WITH UNCERTAIN-BUT-BOUNDED ACTIVITY DURATIONS AND CASH FLOWS II. SOUNDS OF SILENCE: A NEW SAMPLING-BASED HYBRID PRIMARY-SECONDARY CRITERIA HARMONY SEARCH METAHEURISTIC

In this paper, we present a new idea for robust project scheduling combined with a cost-oriented uncertainty investigation. The result of the new approach is a makespan minimal robust proactive schedule, which is immune against the uncertainties in the activity durations and which can be evaluated from a cost-oriented point of view on the set of the uncertain-but-bounded duration and cost param...

متن کامل

Precedence Constraint Posting for Cyclic Scheduling Problems

Resource constrained cyclic scheduling problems consist in planning the execution over limited resources of a set of activities, to be indefinitely repeated. In such a context, the iteration period (i.e. the difference between the completion time of consecutive iterations) naturally replaces the makespan as a quality measure; exploiting inter-iteration overlapping is the primary method to obtai...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Intelligent Manufacturing

دوره 21  شماره 

صفحات  -

تاریخ انتشار 2010